Delay - jitter Bound and Statistical Loss Bound forHeterogeneous
نویسنده
چکیده
Network support for variable bit-rate video needs to consider (i) properties of workload induced (e.g., signiicant auto-correlations into far lags and diierent marginal distributions among connections) and (ii) application speciic bounds on delay-jitter and statistical cell-loss probabilities. The objective of this paper is to present a quality-of-service solution for such traac at each multiplexing point in the network. Heterogeneity in both ooered workload and quality-of-service needs are addressed. The framing strategy introduced by Golestani is generalized by inducing the framing structure on virtual circuits (VCs) rather than on communication links. This results in eliminating the phase mismatch between incoming and outgoing frames at the switches. Hence, a signiicant reduction in delay and buuer requirements at each switch traversed by the VC is achieved. An architecture design that can be implemented in a moderate cost is also presented. The framing strategy is combined with an active cell discard, a pseudo earliest-due-date cell dispatcher, and a dropping policy to provide heterogeneous cell-loss bounds, exploit statistical multiplexingand maximize output-link eeciency. An upper bounds on the equivalent bandwidth needed are also calculated and some numerical and simulation results for actual MPEG-I video traces are included.
منابع مشابه
Delay Jitter Control for Real-Time Communication in a Packet Switching Network
A real-time channel is a simplex connection between two nodes characterized by parameters representing the performance requirements of the client. These parameters may include a bound on the minimum connection bandwidth, a bound on the maximum packet delay, and a bound on the maximum packet loss rate. Such a connection may be established in a packet-switching environment by means of the schemes...
متن کاملPer - Stream Jitter Analysis in CBR
| Constant Bit Rate (CBR) traac is expected to be a major source of traac in high-speed networks. Such sources may have stringent delay and loss requirements and in many cases, they should be delivered exactly as they were generated. A simple delay priority scheme will bound the cell delay and jitter for CBR streams, so that in the network switches, CBR traac will only compete with other CBR tr...
متن کاملAn Upper Bound to the Loss Probability in the Multiplexing of Jittered Flows
In the context of Diffserv networks some services should be characterized by end-to-end quantitative QoS guarantees. In order to provide such guarantees to single flows (or flow aggregates), the end-to-end analysis of delay and loss performance in a Diffserv domain is needed. The impact of jitter should be considered in the performance analysis at the successive nodes along the path of a flow (...
متن کاملInvestigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices
In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...
متن کاملFrame-counter scheduler: A novel QoS scheduler for real-time traffic
Real-time traffic communication has Quality of Service (QoS) requirements such as end-to-end bandwidth and delay guarantees. We propose a novel frame-based QoS Scheduler, the frame-counter scheduler, for connection oriented packet switching networks. The frame-counter scheduler significantly reduces the end-to-end delay bound and buffer requirements provided by other frame-based schedulers. A f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996